Precise semidefinite programming formulation of atomic norm minimization for recovering d-dimensional (D ≥ 2) off-the-grid frequencies
نویسندگان
چکیده
Recent research in off-the-grid compressed sensing (CS) has demonstrated that, under certain conditions, one can successfully recover a spectrally sparse signal from a few time-domain samples even though the dictionary is continuous. In particular, atomic norm minimization was proposed in [1] to recover 1-dimensional spectrally sparse signal. However, in spite of existing research efforts [2], it was still an open problem how to formulate an equivalent positive semidefinite program for atomic norm minimization in recovering signals with d-dimensional (d ≥ 2) off-the-grid frequencies. In this paper, we settle this problem by proposing equivalent semidefinite programming formulations of atomic norm minimization to recover signals with d-dimensional (d ≥ 2) off-the-grid frequencies.
منابع مشابه
Off-the-grid Two-Dimensional Line Spectral Estimation With Prior Information
In this paper, we provide a method to recover offthe-grid frequencies of a signal in two-dimensional (2-D) line spectral estimation. Most of the literature in this field focuses on the case in which the only information is spectral sparsity in a continuous domain and does not consider prior information. However, in many applications such as radar and sonar, one has extra information about the s...
متن کاملMmWave Channel Estimation via Atomic Norm Minimization for Multi-User Hybrid Precoding
To perform multi-user multiple-input and multipleoutput transmission in millimeter-wave (mmWave) cellular systems, the high-dimensional channels need to be estimated for designing the multi-user precoder. Conventional grid-based compressed sensing (CS) methods for mmWave channel estimation suffer from the basis mismatch problem, which prevents accurate channel reconstruction and degrades the pr...
متن کاملA Compact Formulation for the L21 Mixed-norm Minimization Problem
We present an equivalent, compact reformulation of the `2,1 mixednorm minimization problem for joint sparse signal reconstruction from multiple measurement vectors (MMVs). The reformulation builds upon a compact parameterization, which models the rownorms of the sparse signal representation as parameters of interest, resulting in a significant reduction of the MMV problem size. Given the sparse...
متن کاملFast algorithms for solving H,-norm minimization problems
H,-norm of the approximation error for both methods satisfies 16, 91 In this paper we propose an efficient computational a p rn proach to minimize the H,-norm of a transfer-function OT+I 5 /IG(s) G,(s)/Im 1 2 x ai (2) matrix depending affinely on a set of free parame.=?+I ters. The minimization problem, formulated as a semiinfinite convex programming problem, is solved via a where > . . . > 0, ...
متن کاملGridless Two-dimensional DOA Estimation With L-shaped Array Based on the Cross-covariance Matrix
The atomic norm minimization (ANM) has been successfully incorporated into the two-dimensional (2-D) direction-ofarrival (DOA) estimation problem for super-resolution. However, its computational workload might be unaffordable when the number of snapshots is large. In this paper, we propose two gridless methods for 2-D DOA estimation with L-shaped array based on the atomic norm to improve the co...
متن کامل